Improved approximation bounds for edge dominating set in dense graphs
نویسندگان
چکیده
منابع مشابه
Improved Approximation Bounds for Edge Dominating Set in Dense Graphs
We analyze the simple greedy algorithm that iteratively removes the endpoints of a maximum-degree edge in a graph, where the degree of an edge is the sum of the degrees of its endpoints. This algorithm provides a 2-approximation to the minimum edge dominating set and minimum maximal matching problems. We refine its analysis and give an expression of the approximation ratio that is strictly less...
متن کاملOn Approximation Complexity of Edge Dominating Set Problem in Dense Graphs
We study the approximation complexity of the Minimum Edge Dominating Set problem in everywhere ǫ-dense and average ǭ-dense graphs. More precisely, we consider the computational complexity of approximating a generalization of the Minimum Edge Dominating Set problem, the so called Minimum Subset Edge Dominating Set problem. As a direct result, we obtain for the special case of the Minimum Edge Do...
متن کاملParameterized Edge Dominating Set in Cubic Graphs
In this paper, we present an improved algorithm to decide whether a graph of maximum degree 3 has an edge dominating set of size k or not, which is based on enumerating vertex covers. We first enumerate vertex covers of size at most 2k and then construct an edge dominating set based on each vertex cover to find a satisfied edge dominating set. To enumerate vertex covers, we use a branch-and-red...
متن کاملApproximation hardness of edge dominating set problems
We provide the first interesting explicit lower bounds on efficient approximability for two closely related optimization problems in graphs, Minimum Edge Dominating Set and Minimum Maximal Matching. We show that it is NP-hard to approximate the solution of both problems to within any constant factor smaller than 7 6 . The result extends with negligible loss to bounded degree graphs and to every...
متن کاملExact Algorithms for Annotated Edge Dominating Set in Cubic Graphs
Given a graph G = (V,E) together with a nonnegative integer requirement on vertices r : V → Z+, the annotated edge dominating set problem is to find a minimum set M ⊆ E such that, each edge in E −M is adjacent to some edge in M , and M contains at least r(v) edges incident on each vertex v ∈ V . The annotated edge dominating set problem is a natural extension of the classical edge dominating se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2009
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2008.12.036